package com.saul.datastructure.zzzsourcecode.ch06recursion;

public class Fibonacci {
    public static int getNumber(int n) {
        if (n == 1) {
            return 0;
        } else if (n == 2) {
            return 1;
        } else {
            return getNumber(n - 1) + getNumber(n - 2);
        }
    }
}
